Location:
Search - shortest path
Search list
Description: 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-The realization of the use of adjacency matrix to the network storage, the establishment of the network, and to achieve single-source shortest path algorithm.
Platform: |
Size: 1024 |
Author: 江紫桉 |
Hits:
Description: 数据结构课程设计_校园导游咨询
1.需求分析
设计一个校园导游程序，为来访的客人提供各种信息查询服务。
(1)设计学校的校园平面图，所含景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。
(2)为来访客人提供图中任意景点相关信息的查询。
(3)提供途中任意景点问路查询，即求任意两个景点间的一条最短的简单路径。
-Data structure course design consulting 1 _ campus tour guides. Needs analysis to design a campus tour guide program for visitors, provide information inquiry service. (1) the design of the school campus plan, contained not less than 10 spots. To map the various scenic spots in the school Vertex, storage Attractions name, code, briefings and other information to edge that path, the path length of storage and other related information. (2) for the visitors to provide map information on any attractions inquiries. (3) provide any spots on his way to ask the way inquiries, that is, for any two among the attractions of a simple shortest path.
Platform: |
Size: 2048 |
Author: 赵寒 |
Hits:
Description: 建立一个学校的场所平面图，可以计算出任意两个地点间的最短路径，以找到人们可行的最佳路途。-The establishment of a school place for floor plan can be calculated between any two locations of the shortest path to find people the best way possible.
Platform: |
Size: 1024 |
Author: 爱雪 |
Hits:
Description: 求两点间最短路径问题的高效率算法
可以直接拿来用，是数据结构中经典程序
-Seek the shortest path between two points of the high efficiency of algorithm can be directly used to use the data structure of the classic procedure
Platform: |
Size: 7168 |
Author: taomanman |
Hits:
Description: 算法设计课程报告单源点最短路径问题，即，已知一个n结点有向图G＝（V,E）和边的权函数c（e），求由某指定结点V0到其他各个结点的最短路径，这里还假定所有的权都是正的。-Algorithm design courses report a single source shortest path problem, that is known to a n-node directed graph G = (V, E) and the edge of the right to function c (e), for a specified node from V0 to the other node point of the shortest path, there is also assumed that all of the right are positive.
Platform: |
Size: 16384 |
Author: dfghj |
Hits:
Description: 图的最短路径查询，用与交通图中最短路径的查询-Map the shortest path query, use and transportation plans in the shortest path query
Platform: |
Size: 2048 |
Author: zhouyou |
Hits:
Description: Dijkstra算法最短路径. -Dijkstra shortest path algorithm. Dijkstra shortest path algorithm.
Platform: |
Size: 1024 |
Author: zhouhaoran |
Hits:
Description: 单源最短路径问题的一种求解算法－Dijkstra算法-Single-source shortest path algorithm A-Dijkstra algorithm
Platform: |
Size: 1024 |
Author: 王振兴 |
Hits:
Description: [实验目的]
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
-[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths.
Platform: |
Size: 4096 |
Author: 王建媚 |
Hits:
Description: 单源最短路径Dijkstra算法.rar-Single-source shortest path Dijkstra algorithm. Rar
Platform: |
Size: 156672 |
Author: sandra |
Hits:
Description: Vc++实现最短路径，利用Kruskal算法，属于数据结构习题-Vc++ To achieve the shortest path, using Kruskal algorithms, data structures belonging to Exercises
Platform: |
Size: 169984 |
Author: 张婷 |
Hits:
Description: Dijkstra最短路径的C#实现，简单明了！-Dijkstra shortest path C# Realized, simple and clear!
Platform: |
Size: 16384 |
Author: Long |
Hits:
Description: VC6.0环境下编译通过，完整实现图的数据结构定义、深度优先搜索和最短路径查找等功能。-VC6.0 compiler environment through the complete realization of graph data structure definitions, depth-first search and find the shortest path functions.
Platform: |
Size: 25600 |
Author: 任飞 |
Hits:
Description: mopathfinder.dll vb+mapobjects开发中可能会用到的最短路径查询。-mopathfinder.dll vb+ mapobjects may be used to develop the shortest path query.
Platform: |
Size: 12288 |
Author: lixue |
Hits:
Description: 建立校园导游图存储结构，对用户的问题（最短路径）予以解答。-The establishment of the campus tour guide map storage structure, the user s problem (shortest path) to be answered.
Platform: |
Size: 229376 |
Author: 陈岑 |
Hits:
Description: Floyd算法的基本思想是，从邻接矩阵a开始进行n次迭代，第一次迭代后a[i,j]的值是从vi到vj且中间不经过变化大于1的顶点的最短路径长度；第k次迭代后a[i,j]的值是从vi到vj且中间不经过变化大于k的顶点的最短路径长度 第n次迭代后a[i,j]的值就是从vi到vj的最短路径长度。-Floyd algorithm for the basic idea is that from the adjacency matrix a start n iterations, after the first iteration a [i, j] values are from vi to vj and not through changes in the middle of more than 1 vertex of the shortest path length the first k iterations after a [i, j] values are from vi to vj and not through changes in the middle of the vertex k is greater than the shortest path length of the first n iterations, after a [i, j] value is from vi to vj of the shortest path length.
Platform: |
Size: 17408 |
Author: 陈冰晶 |
Hits:
Description: 该程序主要用于电路布线设计，对于已知的电路以及要布线的位置选择最短布线路径-The program mainly used for circuit wiring design, for known wiring circuit, as well as the location of choice to the shortest path routing
Platform: |
Size: 1024 |
Author: 何安 |
Hits:
Description: Floyd_Warshall algorithm
用来求解多源点最短路径问题-Floyd_Warshall algorithm used to solve the multi-source shortest path problem
Platform: |
Size: 7168 |
Author: superhero122 |
Hits:
Description: Bellman_Ford 算法，求解带有负权重的边的单源点最短路径问题-Bellman_Ford algorithm, solving with negative edge weights of the single-source shortest path problem
Platform: |
Size: 10240 |
Author: superhero122 |
Hits:
Description: 单源最短路径上机报告含单源最短路径代码
-Single-source shortest path on the machine containing the report of single-source shortest-path code
Platform: |
Size: 7168 |
Author: 蔡延波 |
Hits:
«
1
2
...
45
46
47
48
49
50»